Comparative Study of Parallel Scheduling Algorithm for Parallel Job
نویسندگان
چکیده
منابع مشابه
Online Algorithm for Parallel Job Scheduling and Strip Packing
We consider the online scheduling problem of parallel jobs on parallel machines, P |online − list,mj |Cmax. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7competitive algorithm for this problem. The presented algorithm also applies to the special case where machines are ordered on a line and only adjacent machines can be assigned to a job and, therefor...
متن کاملObjective-Oriented Algorithm for Job Scheduling in Parallel Heterogeneous Systems
This paper presents a new approach to solve the problem of job scheduling for parallel processing in heterogeneous systems. The optimization goals are: (i) minimum total execution time including communication costs and (ii) shortest response time for all jobs. We introduce a classification for the given scheduling problem by the heterogeneity of the systems, from the view of the schedulers’ eye...
متن کاملA Competitive Online Algorithm for a Parallel Job Scheduling Problem
We study a parallel job scheduling problem in which parallel jobs may be assigned to any number of processors in a parallel computing system. If a job of size p j is assigned to k j processors, its running time is assumed to be p j=k j + k jc, where c is a constant representing communication overhead for each processor. This model explicitly takes into account the increase in overhead arising f...
متن کاملPower-Aware Parallel Job Scheduling
Recent increase in performance of High Performance Computing (HPC) centers has been followed by even higher increase in power consumption. Power draw of modern supercomputers is not only an economic problem but it has negative consequences on environment. Roughly speaking, CPU power presents 50% of total system power. Dynamic Voltage Frequency Scaling(DVFS) is a technique widely used to manage ...
متن کاملJob Scheduling on Parallel Systems
Parallel systems such as supercomputers are valuable resources which are each commonly shared among a community of users. The problem of job scheduling is to determine how that sharing should be done in order to maximize the system’s utility. This problem has been extensively studied for well over a decade, yielding a great breadth of knowledge and techniques. In this work, we survey the ideas ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2016
ISSN: 0975-8887
DOI: 10.5120/ijca2016908061